Querying Trees with Pointers
نویسندگان
چکیده
We introduce a data model for semi-structured data and explore a spatial logic for reasoning about this model. This note is part of an on-going project to develop a pattern-matching language for analysing and manipulating semi-structured data. This work was first reported in Appsem 2001 and the session on spatial logic at MFPS 2002.
منابع مشابه
A Proposal for Indexing Bitemporal Databases via Cooperative B+-trees
In this paper we propose an indexing structure for bitemporal databases. Such structure is based on two trees, one indexing valid time and another indexing transaction time. The trees share pointers to the actual data records, which are thus not duplicated. Bitemporal queries are processed by dividing the query in two parts, a valid time part and a transaction time part. Each tree is searched a...
متن کاملParaSail: A Pointer-Free Path to Object-Oriented Parallel Programming
Pointers are ubiquitous in modern object-oriented programming languages, and many data structures such as trees, lists, graphs, hash tables, etc. depend on them heavily. Unfortunately, pointers can add significant complexity to programming. ParaSail, a new parallel object-oriented programming language, has adopted an alternative, pointer-free approach to defining data structures. Rather than us...
متن کاملQuerying Unranked Trees with Stepwise Tree Automata
The problem of selecting nodes in unranked trees is the most basic querying problem for XML. We propose stepwise tree automata for querying unranked trees. Stepwise tree automata can express the same monadic queries as monadic Datalog and monadic second-order logic. We prove this result by reduction to the ranked case, via a new systematic correspondence that relates unranked and ranked queries.
متن کاملImplementation of Binary Search Trees Via Smart Pointers
Study of binary trees has prominent place in the training course of DSA (Data Structures and Algorithms). Their implementation in C++ however is traditionally difficult for students. To a large extent these difficulties are due not so much to the complexity of algorithms as to language complexity in terms of memory management by raw pointers – the programmer must consider too many details to en...
متن کاملDeveloping a BIM-based Spatial Ontology for Semantic Querying of 3D Property Information
With the growing dominance of complex and multi-level urban structures, current cadastral systems, which are often developed based on 2D representations, are not capable of providing unambiguous spatial information about urban properties. Therefore, the concept of 3D cadastre is proposed to support 3D digital representation of land and properties and facilitate the communication of legal owners...
متن کامل